A Hybrid Method Integrating a Discrete Differential Evolution Algorithm with Tabu Search Algorithm for the Quadratic Assignment Problem: A New Approach for Locating Hospital Departments
نویسندگان
چکیده
The facility layout problem (FLP) is a very important class of NP-hard problems in operations research that deals with the optimal assignment facilities to minimize transportation costs. quadratic (QAP) can model FLP effectively. One FLPs hospital aims place comprehensive clinics, laboratories, and radiology units within predefined boundaries way minimizes cost movement patients healthcare personnel. We are going develop hybrid method based on discrete differential evolution (DDE) algorithm for solving QAP. In existing DDE algorithms, certain issues such as premature convergence, stagnation, exploitation mechanism have not been properly addressed. this study, we first aim discover make current worse identify best solution problem, then propose (HDDETS) by combining tabu search (TS) algorithms enhance algorithm. Then, performance proposed HDDETS evaluated implementing benchmark instances from QAPLIB website comparing TS instances. It found has better than both where obtained 42 best-known solutions 56 instances, while 15 18 out respectively. Finally, apply find distributions advisory clinics inside Azadi Hospital Iraq total travel distance when they move among these clinics. Our application shows could distribution hospital’s rooms, which modeled QAP, reduced traveled patients.
منابع مشابه
Offering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSelf Controlling Tabu Search algorithm for the Quadratic Assignment Problem
This paper addresses the application of the principles of feedback and self-controlling software to the tabu search algorithm. We introduce two new reaction strategies for the tabu search algorithm. The first strategy treats the tabu search algorithm as a target system to be controlled and uses a control-theoretic approach to adjust the algorithm parameters that affect search intensification. T...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملA Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem
The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2021
ISSN: ['1026-7077', '1563-5147', '1024-123X']
DOI: https://doi.org/10.1155/2021/6653056